Phylogenetic diversity and the maximum coverage problem
نویسندگان
چکیده
منابع مشابه
The Budgeted Maximum Coverage Problem
The budgeted maximum coverage problem is: given a collection S of sets with associated costs deened over a domain of weighted elements, and a budget L, nd a subset of S 0 S such that the total cost of sets in S 0 does not exceed L, and the total weight of elements covered by S 0 is maximized. This problem is NP-hard. For the special case of this problem, where each set has unit cost, a (1 ? 1 e...
متن کاملThe Generalized Maximum Coverage Problem
We define a new problem called the Generalized Maximum Coverage Problem (GMC). GMC is an extension of the Budgeted Maximum Coverage Problem, and it has important applications in wireless OFDMA scheduling. We use a variation of the greedy algorithm to produce a ( 2e−1 e−1 + )-approximation for every > 0, and then use partial enumeration to reduce the approximation ratio to e e−1 + .
متن کاملTwo-Dimensional Maximum p-Coverage Problem with Partial Coverage
In this paper, we introduce a new generalization of the classical maximum p-coverage problem (MCP) in which p geometric objects of known dimensions are to be located such that their union covers maximum weight distributed on a two-dimensional plane using another set of geometric objects such as circles, rectangles, polygons, etc. We allow partial coverage in the foregoing generalization and den...
متن کاملTabu Search for the Maximum Diversity Problem
In this paper, we develop new heuristic procedures for the maximum diversity problem (MDP). This NPhard problem has a significant number of practical applications such as environmental balance, telecommunication services or genetic engineering. The proposed algorithm is based on the tabu search methodology and incorporates memory structures for both construction and improvement. Although propos...
متن کاملComputational aspects of the maximum diversity problem
We address two variations of the maximum diversity problem which arises when m elements are to be selected from an n-element population based on inter-element distances. We study problem complexity and propose randomized greedy heuristics. Performance of the heuristics is tested on a limited basis.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 2009
ISSN: 0893-9659
DOI: 10.1016/j.aml.2009.03.017